Saturation Numbers of Books
نویسندگان
چکیده
منابع مشابه
Saturation Numbers of Books
A book Bp is a union of p triangles sharing one edge. This idea was extended to a generalized book Bb,p, which is the union of p copies of a Kb+1 sharing a common Kb. A graph G is called an H-saturated graph if G does not contain H as a subgraph, but G∪ {xy} contains a copy of H, for any two nonadjacent vertices x and y. The saturation number of H, denoted by sat(H,n), is the minimum number of ...
متن کاملSaturation Numbers for Trees
For a fixed graph H, a graph G is H-saturated if there is no copy of H in G, but for any edge e 6∈ G, there is a copy of H in G + e. The collection of Hsaturated graphs of order n is denoted by SAT(n,H), and the saturation number, sat(n,H), is the minimum number of edges in a graph in SAT(n,H). Let Tk be a tree on k vertices. The saturation numbers sat(n, Tk) for some families of trees will be ...
متن کاملSaturation Numbers in Tripartite Graphs
Given graphs H and F , a subgraph G ⊆ H is an F -saturated subgraph of H if F * G, but F ⊆ G + e for all e ∈ E(H) \ E(G). The saturation number of F in H, denoted sat(H,F ), is the minimum number of edges in an F -saturated subgraph of H. In this paper we study saturation numbers of tripartite graphs in tripartite graphs. For ` ≥ 1 and n1, n2, and n3 sufficiently large, we determine sat(Kn1,n2,...
متن کاملA note on Ramsey numbers for books
The book with n pages Bn is the graph consisting of n triangles sharing an edge. The book Ramsey number r(Bm, Bn) is the smallest integer r such that either Bm ⊂ G or Bn ⊂ G for every graph G of order r. We prove that there exists a positive constant c such that r(Bm, Bn) = 2n + 3 for all n ≥ cm.
متن کاملSaturation numbers for families of graph subdivisions
For a family F of graphs, a graph G is F-saturated if G contains no member of F as a subgraph, but for any edge uv in G, G+ uv contains some member of F as a subgraph. The minimum number of edges in an F-saturated graph of order n is denoted sat(n,F). A subdivision of a graph H, or an H-subdivision, is a graph G obtained from H by replacing the edges of H with internally disjoint paths of arbit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2008
ISSN: 1077-8926
DOI: 10.37236/842